Practical Timing Analysis of Asynchronous Circuits Using Time Separation of Events

نویسندگان

  • Supratik Chakraborty
  • Kenneth Y. Yun
  • David L. Dill
چکیده

We present a unified technique for timing verification and performance analysis of complex asynchronous circuits designed with implicit timing assumptions. We model interacting asynchronous controllers and datapath elements using timing constraint graphs. Performance metrics and circuit timing constraints to be checked are formulated as time separations between appropriate events. Time separations between all pairs of events are then efficiently computed in a single pass. We present results of analyzing a real asynchronous differential equation solver chip [7] using our proposed technique, thereby demonstrating the practicality of our approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Timing analysis of asynchronous systems using time separation of events

This paper describes a pseudo-polynomial time algorithm for timing analysis of a class of choice-free asynchronous systems, called tightly-coupled systems, with both min and max type timing constraints and bounded component delays. The algorithm consists of two phases: (i) longterm behavior analysis, that computes bounds on the time separation of events after the system has run for a sufficient...

متن کامل

Practical Timing Analysis of Asynchronous Systems Using Time Separation of Events

We present a unified technique for timing verification and performance analysis of complex asynchronous systems designed with implicit timing assumptions. Our method models interacting controllers and datapath elements using timing constraint graphs. Performance metrics and timing constraints to be verified are formulated as time separations between appropriate events. Separations between all r...

متن کامل

Symbolic Time Separation of Events

We extend the TSE [14] timing analysis algorithm into the symbolic domain, that is, we allow symbolic variables to be used to specify unknown parameters of the model (essentially, unknown delays) and verification algorithms which are capable of identifying not just failure or success, but also the constraints on these symbolic variables which will ensure successful verification. The two main co...

متن کامل

Polynomial-time Techniques for Approximate Timing Analysis of Asynchronous Systems a Dissertation Submitted to the Department of Electrical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

As designers strive to build systems on chips with ever diminishing device sizes, and as clock speeds of gigahertz and above are being contemplated, the limitations of synchronous circuits are beginning to surface. Consequently, there has been a renewed interest in asynchronous design techniques that use judicious timing assumptions to obtain fast circuits with low hardware overhead. However, t...

متن کامل

Efficient Algorithms for Approximate Time Separation of Events

Finding bounds on time separation of events is a fundamental problem in verification and analysis of asynchronous and concurrent systems. Unfortunately, even for systems without repeated events or choice, computing exact bounds on time separation of events is an intractable problem when both min and max type timing constraints are present. In this paper, we describe a method for approximating m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998